The error bound property for a solution set defined by a set-valued mappingrefers to an inequality that bounds the distance between vectors closed to asolution of the given set by a residual function. The error bound property is aLipschitz-like/calmness property of the perturbed solution mapping, orequivalently the metric subregularity of the underlining set-valued mapping. Ithas been proved to be extremely useful in analyzing the convergence of manyalgorithms for solving optimization problems, as well as serving as aconstraint qualification for optimality conditions. In this paper, we study theerror bound property for the solution set of a very general second-order conecomplementarity problem (SOCCP). We derive some sufficient conditions for errorbounds for SOCCP which is verifiable based on the initial problem data.
展开▼
